Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem
نویسندگان
چکیده
منابع مشابه
A template-based adaptive large neighborhood search for the consistent vehicle routing problem
The consistent vehicle routing problem (ConVRP), as defined in [1], is an extension of the periodic vehicle routing problem. This problem category involves the construction of routes over a given time period, e.g several days, such that customer demands are met. However, a simple delivery is nowadays not enough for companies to differentiate themselves in a competitive environment. For this rea...
متن کاملAn Adaptive Large Neighborhood Search Heuristic for a Multi-Period Vehicle Routing Problem
We consider tactical planning for a particular class of multi-period vehicle routing problems (MPVRP). This problem involves optimizing product collection and distribution from several production locations to a set of processing plants over a planning horizon. Each horizon consists of several days, and the collection-distribution are performed on a repeating daily basis. In this context, a sing...
متن کاملAn adaptive large neighborhood search for a vehicle routing problem with multiple routes
The vehicle routing problem with multiple trips consists in determining the routing of a fleet of vehicles where each vehicle can perform multiple routes during its workday. This problem is relevant in applications where the duration of each route is limited, for example when perishable goods are transported. In this work, we assume that a fixed-size fleet of vehicles is available and that it m...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملAn adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2020
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21959